A Denotational Semantics for the π-Calculus

نویسنده

  • B. Aziz
چکیده

In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark’s denotational model for the π-calculus and provide a full definition of the semantic domains involved. We also include an example of how the model may be approximated in an abstract interpretation analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fully abstract coalgebraic semantics for the pi-calculus under weak bisimilarity

Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the π-calculus under weak early bisimilarity.

متن کامل

Outline of a Denotational Semantics for the π-Calculus

It appears possible to give a fairly standard denotational semantics for the π-calculus, provided that we work within a functor category indexed by a category I of finite sets and injections. The construction is driven by the expansion law, and resembles Abramsky’s domain of synchronisation trees [1]. It also extends Ingólfsdóttir’s work on domain models of value-passing CCS [4]. The relevant p...

متن کامل

A Privacy Analysis for the π-calculus: The Denotational Approach

We present a non-uniform static analysis for the π-calculus that is built on a denotational semantics of the language and is useful in detecting instances of information leakage and insecure communications in systems with multi-level security policies. To ensure the termination of the analysis, we propose an abstraction, which maintains a finite number of names to be generated by any process. W...

متن کامل

Presheaf Models for the π-Calculus

Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the π-calculus, a calculus for ‘mobile processes’ whose communication topology varies as channels are ...

متن کامل

Concurrent and Located Synchronizations in pi-Calculus

We present two novel semantics for π-calculus. The first allows one to observe on which channel a synchronization is performed, while the second allows concurrent actions, provided that they do not compete for resources. We present both a reduction and a labeled semantics, and show that they induce the same behavioral equivalence. As our main result we show that bisimilarity is a congruence for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001